Secure Multi-Party Computation over Networks
نویسندگان
چکیده
Consider a set of parties who do not trust each other but want to compute some agreed function of their inputs in a secure way. This problem is known as multi-party computation. It has various interesting applications including election over the internet, electric contracts, private and secret database, joint signatures, and others. A number of techniques for the problem have been proposed. Secure protocols for multipaty computation known so far are mainly based on threshold secret sharing, verifiable secret sharing, zero-knowledge proofs, and error-correcting codes. We survey important and interesting results on secure multi-party computation under the existence of various types of adversaries. key words: security, secure protocols, multi-party computation, cryptography
منابع مشابه
E cient Constant Round Multi-Party Computation Combining BMR and SPDZ
Abstract. Recently, there has been huge progress in the field of concretely e cient secure computation, even while providing security in the presence of malicious adversaries. This is especially the case in the twoparty setting, where constant-round protocols exist that remain fast even over slow networks. However, in the multi-party setting, all concretely e cient fully-secure protocols, such ...
متن کاملEfficient Constant Round Multi-party Computation Combining BMR and SPDZ
Recently, there has been huge progress in the field of concretely efficient secure computation, even while providing security in the presence of malicious adversaries. This is especially the case in the twoparty setting, where constant-round protocols exist that remain fast even over slow networks. However, in the multi-party setting, all concretely efficient fully-secure protocols, such as SPD...
متن کاملSTUDIES ON FAULT - TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor
Title of dissertation: STUDIES ON FAULT-TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor of Philosophy, 2007 Dissertation directed by: Professor Jonathan Katz Department of Computer Science In this dissertation, we consider the design of broadcast and secure multi-party computation (MPC) protocols in the presence of adversarial faults. Secure multi-party computation is the most ge...
متن کاملStudies on Fault-tolerant Broadcast and Secure Computation
Title of dissertation: STUDIES ON FAULT-TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor of Philosophy, 2007 Dissertation directed by: Professor Jonathan Katz Department of Computer Science In this dissertation, we consider the design of broadcast and secure multi-party computation (MPC) protocols in the presence of adversarial faults. Secure multi-party computation is the most ge...
متن کاملSecure Multi-Party Computation (Excerpts of Chapter 2)
3 Secure Multi-Party Computation 2 3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.1.1 Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.1.2 Security Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Passively Secure Multi-Party Computation . . . . . . . . . . . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000